Flow-Aware Service Function Embedding Algorithm in Programmable Data Plane

Service function chaining (SFC) is an indispensable technique for Internet service providers to efficiently manage their networks. However, SFC poses requirements of additional processing time functions (SFs) and increased routing owing detoured paths. In this paper, we introduce the use a programmable data plane (PDP) reduce times in SFC. We first classify existing PDP-empowered schemes analyze pros cons. An optimization problem, find optimal SF embedding strategy minimizing completion while utilizing PDP switch resources, formulated flow-aware (FASE) algorithm that complementarily combines redundant re-circulation approaches devised. FASE implemented over commercial experimental results demonstrate can by up 33% compared with conventional resources efficiently.